Reformulating Propositional Satissability as Constraint Satisfaction

We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare local search methods like GSAT and WalkSAT on a SAT problem against the Min-Connicts procedure applied to its encoding. Finally, we look at the special case of local search methods applied to 2-SAT problems and encodings of 2-SAT problems. Our results provide insight into the relationship between propositional satissability and constraint satisfaction, as well as some of the potential beneets of reformulating problems as constraint satisfaction problems.